Non-Uniformities Introduced by Virtual Channel Deadlock Prevention
نویسنده
چکیده
A common scheme for preventing deadlock in networks is the virtual channel method of Dally and Seitz [DS87]. Due to the nature of this scheme, an otherwise completely uniform network will have non-uniformities introduced into it. The variations introduce several e ects, ranging from limitations on overall network performance to di erences in observed network characteristics from node to node and from message to message.
منابع مشابه
Deadlock-free wormhole routing algorithms for star graph topology
For constructing massively parallel multicomputers with over 5000 processing nodes, the Star Graph topology is known to be better than the hypercube in terms of the average routing distance, the number of links per node, and the fault diameter. The authors present two deadlock-free algorithms for routing in Star Graph, assuming the Wormhole routing model. Both the algorithms use the concept of ...
متن کاملEnhanced Buffer Router Design in NOC
This paper presents an advance router design using enhanced buffer. The design provides advantages of both buffer and bufferless network for that two cross bar switches are used. The concept of virtual channel (VC) is eliminated from the previous design by using an efficient flow-control scheme that uses the storage already present in pipelined channels in place of explicit input virtual channe...
متن کامل7 Deadlock-free Routing in Ssn
24 electronic LAN, OCI and the bidirectional shuuenet. One important advantage of the last solution (over the previous two) is that it allows the independent choice of the most cost eeective deadlock free routing scheme for each level of the SSN architecture. 8 Conclusions Deadlocks in wormhole routing networks occur when a state is reached such that no messages can be forwarded towards their d...
متن کاملHierarchical adaptive routing: a framework for fully adaptive and deadlock-free wormhole routing
Adaptive routing can improve network performance and fault-tolerance by providing multiple routing paths. However, the implementation complexity of adaptive routing can be signiicant, discouraging its use in commercial massively parallel systems. In this paper, we introduce Hierarchical Adaptive Routing (HAR), a new adaptive routing framework, which provides a uni-ed framework for simple and hi...
متن کامل[13] J. Duato. A Necessary and Sufficient Condition for
This paper presents a simple, efficient and cost effective routing strategy that considers deadlock recovery as opposed to prevention. Performance is optimized in the absence of deadlocks by allowing maximum flexibility in routing. Disha supports true fully adaptive routing where all virtual channels at each node are available to packets without regard for deadlocks. Deadlock cycles, upon formi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992